Discrete decision theory: manipulations
نویسندگان
چکیده
منابع مشابه
Algorithmic Decision Theory within Discrete Complex Networks
Algorithmic decision theory becomes more and more important. We will present a theoretical and practical point of view to the role of networks and dynamic flow problems in complex environments. To support a decision support management a comfortable software implementation for solving multiobjective discrete control and dynamic flow problems on networks will be presented. As many processes from ...
متن کاملEvaluation of monitoring network density using discrete entropy theory
The regional evaluation of monitoring stations for water resources can be of great importance due to its role in finding appropriate locations for stations, the maximum gathering of useful information and preventing the accumulation of unnecessary information and ultimately reducing the cost of data collection. Based on the theory of discrete entropy, this study analyzes the density of rain gag...
متن کاملA formal theory for conceptualizing artefacts and tool manipulations
Artefacts (physical and institutional) are ubiquitous of our social environment. We live in a tight network of socio-technical systems, which are systems where agents interact with created objects. There is an increasing need for rigorous methods to model, specify, and reason about socio-technical systems in general, and about artefacts and their functions in particular. We propose a formal the...
متن کاملDecision Theory
Decision theory seeks to establish general principles of rationality to guide decision makers in situations involving risk or uncertainty. It is a vibrant subject covering many academic disciplines with numerous subspecialties. I cannot hope to do justice to even a small portion of the recent developments in a piece of this length, so I will confine my attention to what I see as the threl most ...
متن کاملDiscrete Optimization with Decision Diagrams
We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, while restricted BDDs supply a primal heuristic. Each problem is given a dynamic programming model that allows one to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90130-7